Search problem - PDFSEARCH.IO - Document Search Engine

Search problem
Results: 674

#	Item
11	Microsoft Worddoc Add to Reading List Source URL: publik.tuwien.ac.at Language: English - Date: 2008-08-01 06:21:03 Mathematics Routing algorithms Edsger W. Dijkstra Graph theory Applied mathematics Search algorithms Game artificial intelligence Combinatorial optimization A* search algorithm Shortest path problem Maze Algorithm
12	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Statistics Applied mathematics Data mining Search algorithms Approximation algorithms Discrete geometry Nearest neighbor search Numerical analysis Hierarchical clustering Cluster analysis K-means clustering
13	usinggraphcuts_in_gpus_for_color_based_human_skin_segmentation_revision Add to Reading List Source URL: www.gcg.ufjf.br Language: English - Date: 2016-07-25 19:25:40 Graph theory Mathematics Network flow Computer vision Image segmentation Search algorithms Edsger W. Dijkstra Graph cuts in computer vision Maximum flow problem Watershed Flow network Pushrelabel maximum flow algorithm
14	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree
15	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-04-18 04:16:48 Mathematics Search algorithms Information retrieval Information science Hashing Analysis of algorithms Cryptographic hash functions Computational complexity theory Universal hashing Hash function Randomized algorithm Subset sum problem
16	Algorithms and Data Structures (WS15/16) Exercises for Units 14 and 15 Problem 1 Try to get some feel for the behavior of the splay tree data structure. Draw a binary search tree with 5-10 nodes, and work out a few splay Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-08 10:53:22 Binary trees Computing Computer programming Splay tree Software engineering Binary search tree Tree Search tree Optimal binary search tree Link/cut tree
17	Digitization, orphan works and the problem of “diligent search”: which way forward for European cultural institutions? Maurizio Borghi Professor of Law Add to Reading List Source URL: diligentsearch.eu Language: English - Date: 2016-04-19 11:05:12 Intellectual property law Monopoly Information Computing Data Copyright law Orphan works Digitizing Google Art Project Google Books Intellectual property Copyright
18	Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey Sven Schuiererz Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:05:22 Mathematics Routing algorithms Edsger W. Dijkstra Combinatorial optimization Search algorithms Theoretical computer science A* search algorithm Algorithm Rectangle Robot Shortest path problem
19	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 15, 2011 Problem Set 2 Solutions Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-08 02:53:29 Hashing Information retrieval Information science Search algorithms Hash table Hash function Quadratic probing Cryptographic hash function Linear probing Trie Double hashing Hash list